Package ‘ bipartite ’
نویسندگان
چکیده
Title Visualising bipartite networks and calculating some ecological indices. Description Bipartite provides functions to viualise webs and calculate a series of indices commonly used to describe pattern in ecological webs. It focusses on webs consisting of only two trophic levels, e.g. pollination webs or predator-prey-webs. Visualisation is important to get an idea of what we are actually looking at, while the indices summarise different aspects of the webs topology.
منابع مشابه
Netpredictor: R and Shiny package to perform Drug-TargetBipartite network analysis and prediction of missing links
Netpredictor is an R package for prediction of missing links in any given bipartite network. The package provides utilities to compute missing links in a bipartite and well as unipartite networks using Random Walk with Restart and Network inference algorithm. The package also allows computation of Bipartite network properties, visualization of communities for two different sets of nodes, and ca...
متن کاملThe biGraph – package
This package is an extension to the igraph–package [1] and provides a set of tools specifically aimed at the analysis of bipartite graphs. While intended to be continuously extended regarding functionality, the current focus lies on the projection of bipartite graphs, specifically concerning the associated information loss. In addition, clustering and community detection among vertex subsets is...
متن کاملBiMAT: a MATLAB(R) package to facilitate the analysis and visualization of bipartite networks
The statistical analysis of the structure of bipartite ecological networks has increased in importance in recent years. Yet, both algorithms and software packages for the analysis of network structure focus on properties of unipartite networks. In response, we describe BiMAT, an objectoriented MATLAB package for the study of the structure of bipartite ecological networks. BiMAT can analyze the ...
متن کاملOn a Relation between Szeged and Wiener Indices of Bipartite Graphs
Hansen et. al., using the AutoGraphiX software package, conjectured that the Szeged index Sz(G) and the Wiener index W (G) of a connected bipartite graph G with n ≥ 4 vertices and m ≥ n edges, obeys the relation Sz(G) − W (G) ≥ 4n − 8. Moreover, this bound would be the best possible. This paper offers a proof to this conjecture.
متن کاملThe clustComp package
This document presents an overview to the clustComp package, which is a collection of tools developed for the comparison and the visualisation of relationships between two clusterings, either flat versus flat or flat versus hierarchical. Both situations are addressed by representing clusters as nodes in a weighted bipartite graph, where each layer corresponds to one of the clusterings under com...
متن کامل